Shortest Paths in Reachability Graphs
نویسندگان
چکیده
منابع مشابه
Lower and upper bounds of shortest paths in reachability graphs
We prove the following property for safe marked graphs, safe conflict-free Petri nets, and live and safe extended free-choice Petri nets. We prove the following three results. If the Petri net is a marked graph, then the length of the shortest path is at most (|T |−1)·|T |/2. If the Petri net is conflict free, then the length of the shortest path is at most (|T |+1)·|T |/2. If the Petri net is ...
متن کاملShortest Paths In Unweighed Graphs
When dealing with shortest paths in weighed or unweighed graphs, one may solve one-to-one, one-to-all or all-to-all instances. But the known algorithms compute one single shortest path of the considered instance. This article describes a new algorithm (patent pending) designed to compute all the shortest paths between two vertices of a directed, strongly connected and unweighed graph G, contain...
متن کاملShortest paths in conservative graphs
We give a polynomial algorithm to compute shortest paths in weighted undirected graphs with no negative cycles (conservative graphs). We show that our procedure gives a simple algorithm to compute optimal T-joins (and consequently all of their special cases, including weighted matchings). We nally give a direct algorithmic proof for arbitrary weights of a theorem of Seb} o characterizing conser...
متن کاملShortest paths on dynamic graphs
Among the variants of the well known shortest path problem, those that refer to a dynamically changing graphs are theoretically interesting, as well as computationally challenging. Applicationwise, there is an industrial need for computing point-to-point shortest paths on large-scale road networks whose arcs are weighted with a travelling time which depends on traffic conditions. We survey rece...
متن کاملMaintaining Shortest Paths in Dynamic Graphs
The first set of problems relies on the notion of Time-Dependent Networks. The considered model is a directed graph which temporal characteristics are fully known before processing the graph. Several interesting results have already been proved. For instance, Kaufmann and Smith have shown that finding the minimum time walk in FIFO networks is polynomial [2]. But, if the FIFO constraint is not s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1995
ISSN: 0022-0000
DOI: 10.1006/jcss.1995.1070